Smooth movement and Manhattan path based Random Waypoint mobility

In this paper, we study the stationary node distribution of a variation of the Random Waypoint mobility model, in which nodes move in a smooth way following one randomly chosen Manhattan path connecting two points. We provide analytical results for the spatial node stationary distribution of this model. As an application, we exploit this result to derive an upper bound on the transmission range of the nodes of a MANET, moving according to this model, that guarantees the connectivity of the communication graph with high probability.